SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Concurrent user</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Concurrent user</span></span>

</h1>

</header>

<p>In <a href="Computer_science" title="Computer science">computer science</a>, the number of <b>concurrent users</b> (sometimes abbreviated as <b>CCU</b>) for a resource in a location, with the location being a computing <a href="Computer_network" title="Computer network">network</a> or a single computer, refers to the total number of <a href="Person" title="Person">people</a> simultaneously accessing or using the resource. The resource can, for example, be a <a href="Computer_program" title="Computer program">computer program</a>, a <a href="Computer_file" title="Computer file">file</a>, or the computer as a whole.<sup id="cite_ref-HohmannBeyond03_1-0" class="reference"><a href="#cite_note-HohmannBeyond03-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup>

</p><p>Keeping track of concurrent users is important in several cases. First, some <a href="Operating_system" title="Operating system">operating system</a> models such as <a href="Time-sharing" title="Time-sharing">time-sharing</a> operating systems allow several users to access a resource on the computer at the same time. As system performance may degrade due to the complexity of processing multiple jobs from multiple users at the same time, the capacity of such a system may be measured in terms of maximum concurrent users.<sup id="cite_ref-SharmaFoundation09_2-0" class="reference"><a href="#cite_note-SharmaFoundation09-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-ChauhanFunda06_3-0" class="reference"><a href="#cite_note-ChauhanFunda06-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup>

</p><p>Second, commercial software vendors often <a href="Software_licensing" class="mw-redirect" title="Software licensing">license a software product</a> by means of a concurrent users restriction. This allows a fixed number of users access to the product at a given time and contrasts with an unlimited user license. For example: Company X buys software and pays for 20 concurrent users. However, there are 100 logins created at implementation. Only 20 of those 100 can be in the system at the same time,<sup id="cite_ref-HohmannBeyond03_1-1" class="reference"><a href="#cite_note-HohmannBeyond03-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-PallattoStudy05_4-0" class="reference"><a href="#cite_note-PallattoStudy05-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> this is known as <a href="Floating_licensing" title="Floating licensing">floating licensing</a>.

</p><p>Concurrent user licensing allows firms to purchase computer systems and software at a lower cost because the maximum number of concurrent users expected to use the system or software at any given time (those users all logged in together) is only a portion of the total system users employed at a company. The concurrent licenses are global and shared by anyone who needs to use the system. This contrasts with "<a href="Per-seat_license" title="Per-seat license">named-seats</a>" licensing, in which one license must be purchased for each and every individual user, whether they are using the system or not.<sup id="cite_ref-PLIUnderstand06_5-0" class="reference"><a href="#cite_note-PLIUnderstand06-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-SommerSAM13_6-0" class="reference"><a href="#cite_note-SommerSAM13-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup>

</p><p>If a company employs 400 system users in which 275 work during the day and 125 work at night, then they can opt to purchase only 275 concurrent user licenses since there will never be more than 275 users on the system during a normal work day. The night workers share 125 of the day users' licenses to use the system. For named-seat licenses, this same company would have to purchase 400 individual licenses, one for each user, and licenses would not be globally shared. The available options for licensing are entirely at the discretion of the vendor selling the product.

</p>

<ul><li><a href="Floating_licensing" title="Floating licensing">Floating licensing</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFHohmann,_L.2003" class="citation book cs1">Hohmann, L. (2003). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=0slJ8zynjCEC&pg=PA76"><i>Beyond Software Architecture: Creating and Sustaining Winning Solutions</i></a>. Addison-Wesley Professional. pp. <span class="nowrap">76–</span>8. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>9780132465946</bdi>.</cite></span>

</li>

<li id="cite_note-SharmaFoundation09-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-SharmaFoundation09_2-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFSharma,_D.P.2008" class="citation book cs1">Sharma, D.P. (2008). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=AjWh-o7eICMC&pg=PA10"><i>Foundation of Operating Systems</i></a>. Excel Books. pp. <span class="nowrap">10–</span>11. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>9788174466266</bdi>.</cite></span>

</li>

<li id="cite_note-ChauhanFunda06-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-ChauhanFunda06_3-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFChauhan,_S.Saxena,_A.Gupta,_K.2006" class="citation book cs1">Chauhan, S.; Saxena, A.; Gupta, K. (2006). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=NN6Hx8s3NjwC&pg=PA84"><i>Fundamentals of Computer</i></a>. Firewall Media. p. 84. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>9788170088547</bdi>.</cite></span>

</li>

<li id="cite_note-PallattoStudy05-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-PallattoStudy05_4-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFPallatto,_J.2005" class="citation web cs1">Pallatto, J. (12 October 2005). <a rel="nofollow" class="external text" href="https://www.eweek.com/it-management/study-shows-enterprises-favor-concurrent-user-software-licenses">"Study Shows Enterprises Favor Concurrent-User Software Licenses"</a>. <i>eWeek</i>. QuinStreet, Inc<span class="reference-accessdate">. Retrieved <span class="nowrap">2 March</span> 2019</span>.</cite></span>

</li>

<li id="cite_note-PLIUnderstand06-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-PLIUnderstand06_5-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFPractising_Law_Institute2006" class="citation book cs1">Practising Law Institute (2006). <i>Understanding the Intellectual Property License</i>. Practising Law Institute. pp. <span class="nowrap">140–</span>42.</cite></span>

</li>

<li id="cite_note-SommerSAM13-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-SommerSAM13_6-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFSommer,_T.2013" class="citation web cs1">Sommer, T. (May 2013). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20130810111112/http://omtco.eu/references/sam/top-200-sam-terms-a-glossary-of-software-asset-management-terms/">"Top 200 SAM Terms – A Glossary Of Software Asset Management Terms"</a>. OMTCO. Archived from <a rel="nofollow" class="external text" href="http://omtco.eu/references/sam/top-200-sam-terms-a-glossary-of-software-asset-management-terms/">the original</a> on 10 August 2013<span class="reference-accessdate">. Retrieved <span class="nowrap">2 March</span> 2019</span>.</cite></span>

</li>

</ol></div></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox" aria-labelledby="Concurrent_computing233" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div id="Concurrent_computing233" style="font-size:114%;margin:0 4em"><a href="Concurrent_computing" title="Concurrent computing">Concurrent computing</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">General</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Concurrency_(computer_science)" title="Concurrency (computer science)">Concurrency</a></li>

<li><a href="Concurrency_control" title="Concurrency control">Concurrency control</a></li>

<li><a href="Concurrent_data_structure" title="Concurrent data structure">Concurrent data structures</a>

<ul><li><a href="Concurrent_hash_table" title="Concurrent hash table">Concurrent hash tables</a></li></ul></li>

<li><a href="Indeterminacy_in_concurrent_computation" title="Indeterminacy in concurrent computation">Indeterminacy</a></li>

<li><a href="Linearizability" title="Linearizability">Linearizability</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Process_calculus" title="Process calculus">Process calculi</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Language_Of_Temporal_Ordering_Specification" class="mw-redirect" title="Language Of Temporal Ordering Specification">LOTOS</a></li>

<li><a href="%CE%A0-calculus" title="Π-calculus">π-calculus</a></li>

<li><a href="Ambient_calculus" title="Ambient calculus">Ambient calculus</a></li>

<li><a href="API-Calculus" title="API-Calculus">API-Calculus</a></li>

<li><a href="Join-calculus" title="Join-calculus">Join-calculus</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Classic problems</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="ABA_problem" title="ABA problem">ABA problem</a></li>

<li><a href="Cigarette_smokers_problem" title="Cigarette smokers problem">Cigarette smokers problem</a></li>

<li><a href="Deadlock_(computer_science)" title="Deadlock (computer science)">Deadlock</a></li>

<li><a href="Dining_philosophers_problem" title="Dining philosophers problem">Dining philosophers problem</a></li>

<li><a href="Producer%E2%80%93consumer_problem" title="Producer–consumer problem">Producer–consumer problem</a></li>

<li><a href="Race_condition" title="Race condition">Race condition</a></li>

<li><a href="Readers%E2%80%93writers_problem" title="Readers–writers problem">Readers–writers problem</a></li>

<li><a href="Sleeping_barber_problem" title="Sleeping barber problem">Sleeping barber problem</a></li></ul>

</div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div>

<ul><li><span class="noviewer" typeof="mw:File"><span title="Category"></span></span> Category: Concurrent computing</li></ul>

</div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-06-14" href="https://en.wikipedia.org/wiki/?title=Concurrent_user&oldid=1295622272">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>